Asymptotically optimal algorithm

Results: 45



#Item
11The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale

The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2015-04-30 10:33:59
12Stability and asymptotic optimality of opportunistic schedulers in wireless systems∗ U. Ayesta1,2 , M. Erausquin1,3 , M. Jonckheere4 , I.M. Verloop1 1  BCAM – Basque Center for Applied Mathematics, Derio, Spain

Stability and asymptotic optimality of opportunistic schedulers in wireless systems∗ U. Ayesta1,2 , M. Erausquin1,3 , M. Jonckheere4 , I.M. Verloop1 1 BCAM – Basque Center for Applied Mathematics, Derio, Spain

Add to Reading List

Source URL: verloop.perso.enseeiht.fr

Language: English - Date: 2011-10-08 11:30:26
13Asymptotic Optimality in Sampling-based Motion Planning Sertac Karaman Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particula

Asymptotic Optimality in Sampling-based Motion Planning Sertac Karaman Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particula

Add to Reading List

Source URL: www.cse.unr.edu

Language: English - Date: 2012-12-20 19:29:35
14Index Policies for a Multi-Class Queue with Convex Holding Cost and Abandonments∗ 1 1,2,5 ˜

Index Policies for a Multi-Class Queue with Convex Holding Cost and Abandonments∗ 1 1,2,5 ˜

Add to Reading List

Source URL: homepages.laas.fr

Language: English - Date: 2014-06-19 10:13:37
15This paper was presented as part of the main technical program at IEEE INFOCOMA Nearly-Optimal Index Rule for Scheduling of Users with Abandonment Urtzi Ayesta∗† , Peter Jacko∗ and Vladimir Novak∗‡ ∗ B

This paper was presented as part of the main technical program at IEEE INFOCOMA Nearly-Optimal Index Rule for Scheduling of Users with Abandonment Urtzi Ayesta∗† , Peter Jacko∗ and Vladimir Novak∗‡ ∗ B

Add to Reading List

Source URL: homepages.laas.fr

Language: English - Date: 2012-01-01 05:04:19
16Asymptotic Optimality in Sampling-based Motion Planning Sertac Karaman Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particula

Asymptotic Optimality in Sampling-based Motion Planning Sertac Karaman Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particula

Add to Reading List

Source URL: iros2011.org

Language: English - Date: 2011-09-21 07:00:30
17Efficient resource allocation in bandwidth-sharing networks ?,‡ Maaike Verloop? , Rudesindo Nu´ nez-Queija ˜

Efficient resource allocation in bandwidth-sharing networks ?,‡ Maaike Verloop? , Rudesindo Nu´ nez-Queija ˜

Add to Reading List

Source URL: verloop.perso.enseeiht.fr

Language: English - Date: 2008-01-05 11:37:36
18Index Policies for a Multi-Class Queue with Convex Holding Cost and Abandonments∗ 1 1,2,5 ˜

Index Policies for a Multi-Class Queue with Convex Holding Cost and Abandonments∗ 1 1,2,5 ˜

Add to Reading List

Source URL: verloop.perso.enseeiht.fr

Language: English - Date: 2014-06-20 08:22:01
19540  Caching with Expiration Times Paxikshit Gopalan

540 Caching with Expiration Times Paxikshit Gopalan" Howard Karlofft

Add to Reading List

Source URL: www.cc.gatech.edu

Language: English - Date: 2002-08-26 13:46:55
20au  Aarhus University ANNUAL REPORT 2009

au Aarhus University ANNUAL REPORT 2009

Add to Reading List

Source URL: madalgo.au.dk

Language: English - Date: 2014-01-20 05:49:01